package bjtuoj;

import java.util.Scanner;

/**
 * ClassName: Test1
 * Description:
 * date: 2021-11-12 19:00
 *
 * @author liyifan
 */
public class Test1 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextInt()) {
            int n = scanner.nextInt();
            int m = scanner.nextInt();
            int[] arr = new int[n];
            for (int i = 0;i < n;i++) {
                arr[i] = scanner.nextInt();
            }
            float max_length = arr[0];
            for(int i = 1; i < n; i++) {
                if (max_length<arr[i])
                    max_length = arr[i];
            }
            double left = 0, right = max_length, mid;
            while (left + 0.01 < right){
                int num = 0;
                mid = (left + right) / 2.00;
                mid = Math.round(mid * 100) / 100.0;
                for (int i = 0; i<n; i++){
                    num += Math.floor(arr[i] / mid);
                }
                if (num >= m){
                    left = mid;
                }
                else{
                    right = mid;
                }
            }
            System.out.printf("%.2f", left);
        }
    }
}